Impact of priority bonuses of Inter-Core Aggregation Scheduler on a commodity CMP platform

نویسندگان

  • Satoshi Yamada
  • Shigeru Kusakabe
چکیده

This paper investigates the effect of changing priority bonuses of Inter-Core Aggregation Scheduler (IAS). IAS is a kernellevel thread scheduler for commodity Chip Multi-Processing (CMP) platforms. To utilize a shared cache and memory on a CMP platform to enhance the performance, IAS executes sibling threads, kernel-level threads sharing the same memory address space, simultaneously on different Cores. To enable this scheduling mechanism, IAS uses the priority bonuses which dynamically enhance the priority of sibling threads in the runqueues of all Cores in scheduling next threads inside the kernel. We evaluate the impact of changing priority bonuses in executing RUBiS benchmark, a Web application benchmark modeling eBay.com. According to our experimental result, IAS enhances the performance of RUBiS benchmark with every priority bonus we applied. We also show that the effect of IAS is influenced by the priority bonuses and we can enhance the effect of IAS by tuning the priority bonuses properly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proposal and Evaluation of APIs for Utilizing Inter-Core Time Aggregation Scheduler

This paper proposes and evaluates APIs for Inter-Core Time Aggregation Scheduler (IAS), which is a kernel-level thread scheduler to enhance performances of multi-threaded programs on multi-core processors. We have proposed IAS, which is a combination of time-multiplexing and space-multiplexing scheduling to utilize caches existing per processing core and shared between processing cores. We pres...

متن کامل

Basic Schemes to Exploit Loop-level Parallelism on the Cell Broadband Engine⋆

CMP architectures provide very high performance and are more energy-efficient than their contemporary single-core. However, programmers must be aware of a wide variety of communication and synchronization mechanisms in order to efficiently exploit thread-level parallelism (TLP). In this work, we present a workload scheduler for CMP architectures to achieve static and dynamic loop-level parallel...

متن کامل

Building a Practical Event-Scheduler for a Multi-Processor Architecture

We describe a scheduler that processes a high number of typed events per second while enabling certain event types to be allocated more resources than others in a workconserving fashion. The scheduler is the core of a high volume messaging system, it uses a lock-free approach allowing it to scale with increasing number of processors. The scheduler threads coordinate using a lock-free concurrent...

متن کامل

Study of the Effects of Program Inputs on Co-Scheduling

Cache sharing in Chip Multiprocessors (CMPs) helps hide the latency of inter-thread communications and improve effective memory bandwidth, but also brings cache contention issues, which often cause cache thrashing and drastic performance degradation. Recent studies show the effectiveness of job co-scheduling in alleviating cache contention, but without exploring the impact of program inputs on ...

متن کامل

Dynamic Resource Allocation for Competing Priority Processing Algorithms on a Cell/B.E. Platform

Scalable video algorithms (SVAs) allow a trade-off between the output quality and resource usage. The priority processing principle provides full utilization of available resources without violating real-time requirements. Even on platforms with limited system resources, this approach results in the best possible output quality given the resources used. This report shows how real-time performan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009